Rough Approximations on Preordered Sets

نویسندگان

  • Yong Chan Kim
  • Young-Sun Kim
چکیده

In this paper, we investigate the properties of rough approximations defined by preordered sets. We study the relations among the lower and upper rough approximations, closure and interior systems, and closure and interior operators.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Adjunctions between Fuzzy Preordered Sets: Necessary Conditions

There exists a direct relation between fuzzy rough sets and fuzzy preorders. On the other hand, it is well known the existing parallelism between Formal Concept Analysis and Rough Set Theory. In both cases, Galois connections play a central role. In this work, we focus on adjunctions (also named isotone Galois connections) between fuzzy preordered sets; specifically, we study necessary conditio...

متن کامل

A kind of fuzzy upper topology on L-preordered sets

Considering a commutative unital quantale L as the truth value table and using the tool of L-generalized convergence structures of stratified L-filters, this paper introduces a kind of fuzzy upper topology, called fuzzy S-upper topology, on L-preordered sets. It is shown that every fuzzy join-preserving L-subset is open in this topology. When L is a complete Heyting algebra, for every completel...

متن کامل

FUZZY PREORDERED SET, FUZZY TOPOLOGY AND FUZZY AUTOMATON BASED ON GENERALIZED RESIDUATED LATTICE

This work is towards the study of the relationship between fuzzy preordered sets and Alexandrov (left/right) fuzzy topologies based on generalized residuated lattices here the fuzzy sets are equipped with generalized residuated lattice in which the commutative property doesn't hold. Further, the obtained results are used in the study of fuzzy automata theory.

متن کامل

Incremental updating approximations in probabilistic rough sets under the variation of attributes

The attribute set in an information system evolves in time when new information arrives. Both lower and upper approximations of a concept will change dynamically when attributes vary. Inspired by the former incremental algorithm in Pawlak rough sets, this paper focuses on new strategies of dynamically updating approximations in probabilistic rough sets and investigates four propositions of upda...

متن کامل

Evaluation of Concepts Understanding

The aim of this paper is to present an approach for following students’ progress in obtaining new knowledge based on rough sets approximations. Consecutive responses of each individual learner to automated tests are placed in appropriate rough sets approximations. The resulting path provides strong indication about the current level of learning outcomes. Key–Words: Rough sets approximations, kn...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Fuzzy Logic and Intelligent Systems

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2011